// 01背包求最优的具体方案
#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 1010;

int n, m;
int v[N], w[N];
int dp[N][N];
int p[N][N];

int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i ++ ) cin >> v[i] >> w[i];
    for (int i = n; i >= 1; i -- )
    {   
        for (int j = 0; j <= m; j ++ )
        {
            dp[i][j] = dp[i + 1][j];
            if (j >= v[i]) dp[i][j] = max(dp[i][j], dp[i + 1][j - v[i]] + w[i]);
            
        }
    }        
    
    int j = m;  
    for (int i = 1; i <= n; i ++ )
        if (j >= v[i] && dp[i][j] == dp[i + 1][j - v[i]] + w[i])
        {
            cout << i << " ";
            j -= v[i];
        }
    return 0;
}
